Network configuration verification in computing systems

ABSTRACT

Techniques of network configuration verification are disclosed herein. One example process includes, upon receiving a query to determine whether a packet from a first endpoint is reachable to a second endpoint in a virtual network, identifying a network path between the first endpoint to the second endpoint in a network graph. The network graph has nodes representing corresponding enforcement points of network policies in the virtual network and edges connecting pairs of the nodes. The example process can also include generating compound function representing conjoined individual constraints of the network policies at each of the nodes in the network graph along the identified network path, compiling the generated compound function into a Boolean formula, and solving the compiled Boolean formula to determine whether an assignment of values to packet fields of the packet exists such that all the conjoined individual constraints of the compound function can be satisfied.

CROSS-REFERENCE TO RELATED APPLICATION(S)

This application is a non-provisional of and claims priority to U.S.patent application Ser. No. 17/542,045 which claims priority to U.S.Provisional Application No. 63/272,993, filed on Oct. 28, 2021, thecontents of each application are hereby expressly incorporated here byreference in their entirety.

BACKGROUND

Distributed computing systems typically include routers, switches,bridges, and other types of network devices that interconnect largenumbers of servers, network storage devices, or other computing devices.The individual servers can host one or more virtual machines (“VMs”),containers, virtual switches, or other virtualized functions. Thevirtual machines or containers can facilitate execution of suitableapplications for individual users to provide to the users desired cloudservices or other suitable computing services.

SUMMARY

This Summary is provided to introduce a selection of concepts in asimplified form that are further described below in the DetailedDescription. This Summary is not intended to identify key features oressential features of the claimed subject matter, nor is it intended tobe used to limit the scope of the claimed subject matter.

Datacenters and other large-scale distributed computing systems canprovide computing resources such as processing power and data storage ascomputing services accessible to tenants such as organizations via acomputer network. Instead of deploying a local enterprise network, anorganization can instead deploy a virtual network in remote datacentersprovided by a cloud computing provider. For example, a virtual privatenetwork (VPN) can link various branches of an organization while datastorage at remote datacenters can hold enterprise data of theorganization. Users of the organization can access various resources onthe virtual network via a computer network such as the Internet. Assuch, the organization can offload certain hardware/software deployment,maintenance, upgrade, or other administrative tasks of various computingresources to the cloud computing provider.

Virtual networks deployed by tenants in datacenters can have complexnetwork policies. Network policies are typically rules embodied insuitable data structures that specify how certain network traffic is tobe processed in a computer network. For example, a tenant can usevirtual networks to isolate a set of virtual machines in one virtualnetwork from other virtual machines in additional virtual networks viasuitable rules restricting network traffic to/from the one virtualnetwork. The tenant can also use rules referred to as Network SecurityGroups (NSGs) or Application Security Groups (ASGs) to enforcereachability restrictions on packets that are transmitted/received bycertain virtual networks and/or endpoints thereof. For example, a NSGcan include rules that either allow a packet to be forwarded or droppedbased on metadata contained in certain header fields of the packet. Thetenant can also design user-defined routes that determine how packetsare forwarded from various endpoints such as virtual machines or virtualnetworks. The tenant can also group two virtual networks forpeer-to-peer communication or configure a virtual wide area network(WAN) connecting endpoints in distant virtual networks. In anotherexample, the tenant can configure service endpoints and privateendpoints to connect VMs to computing services provided by the cloudcomputing provider via suitable rules.

Managing large numbers of network policies with different semantics invirtual networks can be difficult for tenants. Individual networkpolicies are typically not amenable to human inspection unless the rulesof the network policies are exceedingly trivial. The difficulty ofmanaging network policies only grows with scale. For example, a networkpolicy with three rules may be manually inspected. However, a set ofhundreds of network policies each having hundreds of rules is no longeramenable to human inspection.

As such, tenants managing complex network policies often makeconfiguration changes that inadvertently regress safety and/oravailability of various resources on the tenant's virtual networks.Indeed, such misconfiguration of network policies of virtual networkstends to be common. For instance, a tenant can have several virtualnetworks that were originally connected in a mesh topology. Coreservices are deployed in the virtual networks and have reachability tothe Internet with the mesh topology. During a test, a developer of thetenant creates a new virtual hub that receives all traffic to Internetfrom the virtual networks and routes the received traffic to a firewall.However, the developer forgets to configure the firewall to handle allthe traffic to/from the Internet. As a result, all traffic to/from theInternet is blackholed while the core services can no longer be reachedvia the Internet. In another example, when tenants misconfigure NSG orASG policies, reachability with SQL Managed Incident (SQMI) backendservices can be blocked, and thus causing disruptions with data backups.

Verifying network policies and/or changes thereof for virtual networkscan be difficult. Traditionally, network policy verification toolsexpress verification questions directly in low-level languages ofsolvers. For example, to answer a reachability question on routing froma first endpoint to a second endpoint, a verifier can translate arouting table and a reachability query into a Boolean logic formula thatis satisfiable if and only if reachability is preserved by the routingtable. The verifier can then use a solver, such as the Z3 theorem proverprovided by Microsoft Corporation of Redmond, Wash., to derive areachability result. This approach is not viable for verifying largenumbers of network policy types for virtual networks, such as NSGs,route tables, firewalls, service endpoints, private endpoints, servicefirewalls, ASGs, virtual WAN, and virtual peering. The translations ofsuch network policies directly to low-level languages of solvers arecomplex while maintaining correctness of such translations is difficult.In addition, special skills and expertise working with solvers areneeded for performing such translations.

Several embodiments of the disclosed technology can address severalaspects of the foregoing difficulty by implementing a network verifierconfigured to translate network policies of computer networks (e.g.,virtual networks) into Boolean logic formulas via an intermediaterepresentation (IR). In certain implementations, the network verifiercan be configured to retrieve network policies of one or more virtualnetworks of a tenant from a database such as a deployment configurationdatabase maintained by a resource manager or other suitable entities ofa cloud computing platform. Example network policies can include NSGs,route tables, firewalls, service endpoints, private endpoints, servicefirewalls, ASGs, virtual WAN, virtual peering, or other suitable typesof network rules.

The network verifier can then be configured to convert the retrievednetwork policies into a network graph having multiple nodes eachrepresenting a policy enforcement point and interconnected with oneanother by edges each representing packet transmissions and/ortransformations. Each of the edges can also carry an annotation thatdescribes a network policy effective for the corresponding edges. Forinstance, example policy enforcement points can include VMs, NSGs onnetwork interface cards (NICs), subnets inbound and outbound, virtualnetwork inbound and outbound, etc. Thus, an example network graph caninclude a node representing a first VM connected by an edge to a noderepresenting an outbound NSG of a NIC connected to the first VM. Theedge representing a packet transmission or transformation, e.g., thepacket has a source IP address for the VM/NIC transmitted from the VM tothe NIC. The example network graph can also include another noderepresenting a virtual network connected by an additional edge to theoutbound NSG. The additional edge represents a packet transformationthat the packet is allowed by the NSG to be transmitted to the virtualnetwork. The network graph can also include a node representing anotherinbound NSG on another NIC connected to the virtual network and anothernode representing a second VM connected to the other NIC.

Upon identifying the nodes and edges of the network graph, the networkverifier can be configured to encode each node in the network graph forevaluating whether a packet is allowed to be forwarded or is to bedropped. For example, a node representing an NSG can be encoded using arecursive function “Allow” that evaluates a packet received at the nodeto produce a Boolean output (illustratively named “Zen”) indicatingwhether the packet is allowed or dropped in C #language as follows:

Zen<bool> Allow(Nsg nsg, Zen<Packet> pkt, int i) {  if (i >=nsg.Rules.Length)   return false; //if index of rules exceed max,return//  var rule = nsg.Rules[i]; //process Rule[i]//  returnIf(Matches(rule, pkt), rule.Permit, Allow(nsg, pkt, i+1)); // if packetmatches Rule[i], output permit from rule; otherwise, call next rule// }A shown above, the function “Allow” is implemented as a recursivefunction that takes as input an NSG having one or more rules, a packetmodeled as a Zen<Packet> type, and an index of the rule that is to beprocessed (set to zero on the first call), and finally provides anoutput of type Zen<bool> indicating if the packet was dropped orallowed.

Upon constructing the network graph, the network verifier can receive aquery regarding, for example, whether a packet from the first VM canreach the second VM in the virtual network. The query can also includeIP addresses of the first and second VMs as well as other suitableinformation, such as port numbers. In response to receiving the query,the network verifier can be configured to trace one or more networkpaths between the first and second VMs in the virtual network asrepresented on the network graph. For each of the one or more networkpaths, the network verifier can be configured to generate a compoundfunction that conjoins all the recursive functions of the various nodesalong the traced one or more network paths. For example, the compoundfunction can take an output from a first recursive function of a firstnode as input to a second recursive function at a second node downstreamof the first node. The compound function can repeat such conjoiningoperations until all recursive functions along a network path isprocessed.

The network verifier can then convert the generated compound function ofthe traced network path into a logic representation such as an AbstractSyntax Tree (AST) that represents a Boolean formula of the compoundfunction as a logic tree. For example, the code for the recursivefunction above can be initially converted into a list of tokensdescribing the different parts of the code. The list of tokens can thenbe parsed to identify function calls, function definitions, groupings,etc. arranged as a tree to represent a structure of the code. The logictree can then be converted into different kinds of logic code. Forexample, the output code can be JavaScript, machine code, or othersuitable types of code.

Based on the AST corresponding to the compound function, the networkverifier can then be configured to use a solver, e.g., the Z3 theoremprover to determine whether a packet having a source IP address valueand source port value of the first VM and a destination IP address valueand destination port value of the second VM can reach the second VM. Thereachability between the first and second VMS is confirmed only if thereexists an assignment of values to the packet fields such that all theconstraints of the compound function are satisfied.

In certain embodiments, the network verifier can also be configured tooutput evaluation results at each node on the network graph. Forexample, the following illustrates an evaluation result of a routingtable:

{  Type: “RoutingTable”,  Destination: “10.111.0.0/16”,  NextHop:“VnetLocal”,  }

As shown above, the example shows that a packet is forwarded to a nodewith a destination IP of “10.111.0.0/16” in “VnetLocal.” In anotherexample, the following illustrates another evaluation result of an NSGthat denied access to a packet:

{  Type: “NetworkSecurityGroup”,  Description: “Deny to Internet”, Destination: “0.0.0.0/0”,  Source: “*”,  DestinationPorts: “*”, SourcePorts: “*”,  Priority: 65000, }In the example above, all traffic to the Internet is blocked at the NSGnode.

Several embodiments of the network verifier described above can thusprovide a tool that allows tenants to efficiently test and/ortroubleshoot network configuration issues in virtual networks. Thenetwork verifier can receive a query as input, analyzes network paths inthe virtual networks, collect constraints along the network path, andconjoin the collected constraints. The network verifier can then compilethe conjoined constraints into a logic representation and use a solverto solve the conjoined constraints to determine whether reachabilitybetween two endpoints in the virtual network is preserved. Severalembodiments of the network verifier can also output and indicate to thetenants which node on the network graph that caused a packet to bedropped. As such, tenants can readily test modifications of networkpolicies and troubleshoot any misconfigurations in the virtual networksbefore such modification is deployed in the virtual networks.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a schematic diagram illustrating a distributed computingsystem implementing network access verification in accordance withembodiments of the disclosed technology.

FIG. 2 is a schematic diagram illustrating certain hardware/softwarecomponents and operations of the distributed computing system of FIG. 1in accordance with embodiments of the disclosed technology.

FIGS. 3A and 3B are schematic diagrams illustrating example componentsand operations of a network verifier suitable for verifying networkaccess in the distributed computing system of FIG. 1 in accordance withembodiments of the disclosed technology.

FIG. 4 illustrates an example network graph of a virtual network derivedfrom corresponding network policies of the virtual network in accordancewith embodiments of the disclosed technology.

FIG. 5 illustrates a compound function in the example network graph ofthe virtual network in FIG. 4 in accordance with embodiments of thedisclosed technology.

FIG. 6 is a schematic block diagram illustrating example verificationoutput from the network verifier in accordance with embodiments of thedisclosed technology.

FIG. 7 is a computing device suitable for certain components of thedistributed computing system in FIG. 1 .

DETAILED DESCRIPTION

Certain embodiments of systems, devices, components, modules, routines,data structures, and processes for network access verification indatacenters or other suitable distributed computing systems aredescribed below. In the following description, specific details ofcomponents are included to provide a thorough understanding of certainembodiments of the disclosed technology. A person skilled in therelevant art will also understand that the technology can haveadditional embodiments. The technology can also be practiced withoutseveral of the details of the embodiments described below with referenceto FIGS. 1-7 .

As used herein, the term “distributed computing system” generally refersto an interconnected computer system having multiple network nodes thatinterconnect a plurality of servers or hosts to one another and/or toexternal networks (e.g., the Internet). The term “network node”generally refers to a physical network device. Example network nodesinclude routers, switches, hubs, bridges, load balancers, securitygateways, or firewalls. A “host” generally refers to a physicalcomputing device. In certain embodiments, a host can be configured toimplement, for instance, one or more virtual machines, virtual switches,or other suitable virtualized components. For example, a host caninclude a server having a hypervisor configured to support one or morevirtual machines, virtual switches, or other suitable types of virtualcomponents. In other embodiments, a host can be configured to executesuitable applications directly on top of an operating system.

A computer network can be conceptually divided into an overlay networkimplemented over an underlay network in certain implementations. An“overlay network” generally refers to an abstracted network implementedover and operating on top of an underlay network. The underlay networkcan include multiple physical network devices interconnected with oneanother. An overlay network can include one or more virtual networks. A“virtual network” generally refers to an abstraction of a portion of theunderlay network in the overlay network. A virtual network can includeone or more virtual end points referred to as “tenant sites”individually used by a “tenant” or one or more users of the tenant toaccess the virtual network and associated computing, storage, or othersuitable resources. A tenant site can host one or more tenant end points(“TEPs”), for example, virtual machines. The virtual networks caninterconnect multiple TEPs on different hosts.

Virtual network nodes in the overlay network can be connected to oneanother by virtual links individually corresponding to one or morenetwork routes along one or more physical network devices in theunderlay network. In other implementations, a computer network can onlyinclude the underlay network. As used herein, a “network route” or“network path” generally refers to a sequence of one or more networknodes a packet traverses from a source (e.g., a first host) to reach adestination (e.g., a second host). A “round-trip” network routegenerally refers to a pair of inbound and outbound network paths betweena source and a destination. In some examples, the inbound and outboundnetwork paths can be symmetrical, e.g., having the same sequence ofintermediate network nodes in reverse directions. In other examples, theinbound and outbound network paths can be asymmetrical, e.g., havingdifferent sequences and/or intermediate network nodes in reversedirections.

As used herein, a “packet” generally refers to a formatted unit of datacarried by a packet-switched network. A packet typically can includeuser data along with control data. The control data can provideinformation for delivering the user data. For example, the control datacan include source and destination network addresses/ports, errorchecking codes, sequencing information, hop counts, priorityinformation, security information, or other suitable informationregarding the user data. Typically, the control data can be contained inheaders and/or trailers of a packet. The headers and trailers caninclude one or more data field containing suitable information.

FIG. 1 is a schematic diagram illustrating a distributed computingsystem 100 implementing network access verification in accordance withembodiments of the disclosed technology. As shown in FIG. 1 , thedistributed computing system 100 can include an underlay network 108interconnecting a plurality of hosts 106, a plurality of client devices102 associated with corresponding users 101, and a network verifier 125operatively coupled to one another. Even though particular components ofthe distributed computing system 100 are shown in FIG. 1 , in otherembodiments, the distributed computing system 100 can also includeadditional and/or different components or arrangements. For example, incertain embodiments, the distributed computing system 100 can alsoinclude network storage devices, servers, and/or other suitablecomponents in suitable configurations.

As shown in FIG. 1 , the underlay network 108 can include one or morenetwork nodes 112 that interconnect the multiple hosts 106 and theclient device 102 of the users 101. In certain embodiments, the hosts106 can be organized into racks, action zones, groups, sets, or othersuitable divisions. For example, in the illustrated embodiment, thehosts 106 are grouped into three clusters identified individually asfirst, second, and third clusters 107 a-107 c. The individual clusters107 a-107 c are operatively coupled to a corresponding network nodes 112a-112 c, respectively, which are commonly referred to as “top-of-rack”network nodes or “TORs.” The TORs 112 a-112 c can then be operativelycoupled to additional network nodes 112 to form a computer network in ahierarchical, flat, mesh, or other suitable topologies. The underlaynetwork 108 can allow communications among hosts 106, the networkverifier 125, and the client devices 102 of the users 101. In otherembodiments, the multiple clusters 107 a-107 c may share a singlenetwork node 112 or can have other suitable arrangements.

The hosts 106 can individually be configured to provide computing,storage, and/or other cloud or other suitable types of computingservices to the users 101. For example, as described in more detailbelow with reference to FIG. 2 , one of the hosts 106 can initiate andmaintain one or more virtual machines 144 (shown in FIG. 2 ) orcontainers (not shown) upon requests from the users 101. The users 101can then utilize the provided virtual machines 144 or containers toperform database, computation, communications, and/or other suitabletasks. In certain embodiments, one of the hosts 106 can provide virtualmachines 144 for multiple users 101. For example, the host 106 a canhost three virtual machines 144 individually corresponding to each ofthe users 101 a-101 c. In other embodiments, multiple hosts 106 can hostvirtual machines 144 for one or more of the users 101 a-101 c.

The client devices 102 can each include a computing device thatfacilitates the users 101 to access computing services provided by thehosts 106 via the underlay network 108. In the illustrated embodiment,the client devices 102 individually include a desktop computer. In otherembodiments, the client devices 102 can also include laptop computers,tablet computers, smartphones, or other suitable computing devices.Though three users 101 a-101 c are shown in FIG. 1 for illustrationpurposes, in other embodiments, the distributed computing system 100 canfacilitate any suitable numbers of users 101 to access suitablecomputing services provided by the distributed computing system 100.

The network verifier 125 can be configured to allow the users 101 toquery accessibility between endpoints in the virtual network 146 (shownin FIG. 2 ). Though the network verifier 125 is shown in FIG. 1 as asingle entity, in certain implementations, the network verifier 125 canbe implemented in a distributed manner. For instance, one or more partsof logic of the network verifier 125 can be distributedly executed onone or more of the hosts 106 or virtual machines 144. For example, theindividual hosts 106 can include certain instructions execution of whichcause a first host 106 a to convert network policies into a networkgraph while a second host 106 b can independently traceroute a networkpath from a first endpoint to a second endpoint. Example components andoperations of the network verifier 125 are described in more detailbelow with reference to FIGS. 3A and 3B.

FIG. 2 is a schematic diagram illustrating certain hardware/softwarecomponents of the distributed computing system 100 in accordance withembodiments of the disclosed technology. In particular, FIG. 2illustrates an overlay network 108′ that can be implemented on theunderlay network 108 in FIG. 1 . Though particular configuration of theoverlay network 108′ is shown in FIG. 2 , In other embodiments, theoverlay network 108′ can also be configured in other suitable ways. InFIG. 2 , only certain components of the underlay network 108 of FIG. 1are shown for clarity.

In FIG. 2 and in other Figures herein, individual software components,objects, classes, modules, and routines may be a computer program,procedure, or process written as source code in C, C++, C #, Java,and/or other suitable programming languages. A component may include,without limitation, one or more modules, objects, classes, routines,properties, processes, threads, executables, libraries, or othercomponents. Components may be in source or binary form. Components mayinclude aspects of source code before compilation (e.g., classes,properties, procedures, routines), compiled binary units (e.g.,libraries, executables), or artifacts instantiated and used at runtime(e.g., objects, processes, threads).

Components within a system may take different forms within the system.As one example, a system comprising a first component, a secondcomponent and a third component can, without limitation, encompass asystem that has the first component being a property in source code, thesecond component being a binary compiled library, and the thirdcomponent being a thread created at runtime. The computer program,procedure, or process may be compiled into object, intermediate, ormachine code and presented for execution by one or more processors of apersonal computer, a network server, a laptop computer, a smartphone,and/or other suitable computing devices.

Equally, components may include hardware circuitry. A person of ordinaryskill in the art would recognize that hardware may be consideredfossilized software, and software may be considered liquefied hardware.As just one example, software instructions in a component may be burnedto a Programmable Logic Array circuit or may be designed as a hardwarecircuit with appropriate integrated circuits. Equally, hardware may beemulated by software. Various implementations of source, intermediate,and/or object code and associated data may be stored in a computermemory that includes read-only memory, random-access memory, magneticdisk storage media, optical storage media, flash memory devices, and/orother suitable computer readable storage media excluding propagatedsignals.

As shown in FIG. 2 , the first host 106 a and the second host 106 b caneach include a processor 132, a memory 134, a network interface card136, and a packet processor 138 operatively coupled to one another. Inother embodiments, the hosts 106 can also include input/output devicesconfigured to accept input from and provide output to an operator and/oran automated software controller (not shown), or other suitable types ofhardware components.

The processor 132 can include a microprocessor, caches, and/or othersuitable logic devices. The memory 134 can include volatile and/ornonvolatile media (e.g., ROM; RAM, magnetic disk storage media; opticalstorage media; flash memory devices, and/or other suitable storagemedia) and/or other types of computer-readable storage media configuredto store data received from, as well as instructions for, the processor132 (e.g., instructions for performing the methods discussed below withreference to FIGS. 3A-5B). Though only one processor 132 and one memory134 are shown in the individual hosts 106 for illustration in FIG. 2 ,in other embodiments, the individual hosts 106 can include two, six,eight, or any other suitable number of processors 132 and/or memories134.

The first host 106 a and the second host 106 b can individually containinstructions in the memory 134 executable by the processors 132 to causethe individual processors 132 to provide a hypervisor 140 (identifiedindividually as first and second hypervisors 140 a and 140 b) and anoperating system 141 (identified individually as first and secondoperating systems 141 a and 141 b). Even though the hypervisor 140 andthe operating system 141 are shown as separate components, in otherembodiments, the hypervisor 140 can operate on top of the operatingsystem 141 executing on the hosts 106 or a firmware component of thehosts 106.

The hypervisors 140 can individually be configured to generate, monitor,terminate, and/or otherwise manage one or more virtual machines 144organized into tenant sites 142. For example, as shown in FIG. 2 , thefirst host 106 a can provide a first hypervisor 140 a that manages firstand second tenant sites 142 a and 142 b, respectively. The second host106 b can provide a second hypervisor 140 b that manages first andsecond tenant sites 142 a′ and 142 b′, respectively. The hypervisors 140are individually shown in FIG. 2 as a software component. However, inother embodiments, the hypervisors 140 can be firmware and/or hardwarecomponents. The tenant sites 142 can each include multiple virtualmachines 144 for a particular tenant (not shown). For example, the firsthost 106 a and the second host 106 b can both host the tenant site 142 aand 142 a′ for a first tenant 101 a (FIG. 1 ). The first host 106 a andthe second host 106 b can both host the tenant site 142 b and 142 b′ fora second tenant 101 b (FIG. 1 ). Each virtual machine 144 can beexecuting a corresponding operating system, middleware, and/orapplications.

Also shown in FIG. 2 , the distributed computing system 100 can includean overlay network 108′ having one or more virtual networks 146 thatinterconnect the tenant sites 142 a and 142 b across multiple hosts 106.For example, a first virtual network 142 a interconnects the firsttenant sites 142 a and 142 a′ at the first host 106 a and the secondhost 106 b. A second virtual network 146 b interconnects the secondtenant sites 142 b and 142 b′ at the first host 106 a and the secondhost 106 b. Even though a single virtual network 146 is shown ascorresponding to one tenant site 142, in other embodiments, multiplevirtual networks 146 (not shown) may be configured to correspond to asingle tenant site 146.

The virtual machines 144 can be configured to execute one or moreapplications 147 to provide suitable cloud or other suitable types ofcomputing services to the users 101 (FIG. 1 ). For example, the firsthost 106 a can execute an application 147 that is configured to providea computing service that monitors online trading and distribute pricedata to multiple users 101 subscribing to the computing service. Thevirtual machines 144 on the virtual networks 146 can also communicatewith one another via the underlay network 108 (FIG. 1 ) even though thevirtual machines 144 are located on different hosts 106.

Communications of each of the virtual networks 146 can be isolated fromother virtual networks 146. In certain embodiments, communications canbe allowed to cross from one virtual network 146 to another through asecurity gateway or otherwise in a controlled fashion. A virtual networkaddress can correspond to one of the virtual machines 144 in aparticular virtual network 146. Thus, different virtual networks 146 canuse one or more virtual network addresses that are the same. Examplevirtual network addresses can include IP addresses, MAC addresses,and/or other suitable network addresses. To facilitate communicationsamong the virtual machines 144, virtual switches (not shown) can beconfigured to switch or filter packets 114 directed to different virtualmachines 144 via the network interface card 136 and facilitated by thepacket processor 138.

As shown in FIG. 2 , to facilitate communications with one another orwith external devices, the individual hosts 106 can also include anetwork interface card (“NIC”) 136 for interfacing with a computernetwork (e.g., the underlay network 108 of FIG. 1 ). A NIC 136 caninclude a network adapter, a LAN adapter, a physical network interface,or other suitable hardware circuitry and/or firmware to enablecommunications between hosts 106 by transmitting/receiving data (e.g.,as packets) via a network medium (e.g., fiber optic) according toEthernet, Fibre Channel, Wi-Fi, or other suitable physical and/or datalink layer standards. During operation, the NIC 136 can facilitatecommunications to/from suitable software components executing on thehosts 106. Example software components can include the virtual switches141, the virtual machines 144, applications 147 executing on the virtualmachines 144, the hypervisors 140, or other suitable types ofcomponents.

In certain implementations, a packet processor 138 can be interconnectedto and/or integrated with the NIC 136 to facilitate network trafficoperations for enforcing communications security, performing networkvirtualization, translating network addresses, maintaining/limiting acommunication flow state, or performing other suitable functions. Incertain implementations, the packet processor 138 can include aField-Programmable Gate Array (“FPGA”) integrated with the NIC 136.

An FPGA can include an array of logic circuits and a hierarchy ofreconfigurable interconnects that allow the logic circuits to be “wiredtogether” like logic gates by a user after manufacturing. As such, auser 101 can configure logic blocks in FPGAs to perform complexcombinational functions, or merely simple logic operations to synthetizeequivalent functionality executable in hardware at much faster speedsthan in software. In the illustrated embodiment, the packet processor138 has one interface communicatively coupled to the NIC 136 and anothercoupled to a network switch (e.g., a Top-of-Rack or “TOR” switch) at theother. In other embodiments, the packet processor 138 can also includean Application Specific Integrated Circuit (“ASIC”), a microprocessor,or other suitable hardware circuitry. In any of the foregoingembodiments, the packet processor 138 can be programmed by the processor132 (or suitable software components associated therewith) to routepackets inside the packet processor 138 to achieve various aspects oftime-sensitive data delivery, as described in more detail below withreference to FIGS. 3A-5B.

In operation, the processor 132 and/or a user 101 (FIG. 1 ) canconfigure logic circuits in the packet processor 138 to perform complexcombinational functions or simple logic operations to synthetizeequivalent functionality executable in hardware at much faster speedsthan in software. For example, the packet processor 138 can beconfigured to process inbound/outbound packets for individual flowsaccording to configured network policies or rules contained in a flowtable such as a MAT. The flow table can contain data representingprocessing actions corresponding to each flow for enabling privatevirtual networks with customer supplied address spaces, scalable loadbalancers, security groups and Access Control Lists (“ACLs”), virtualrouting tables, bandwidth metering, Quality of Service (“QoS”), etc.

As such, once the packet processor 138 identifies an inbound/outboundpacket as belonging to a particular flow, the packet processor 138 canapply one or more corresponding network policies in the flow tablebefore forwarding the processed packet to the NIC 136 or TOR 112. Forexample, as shown in FIG. 2 , the application 147, the virtual machine144, and/or other suitable software components on the first host 106 acan generate an outbound packet 114 destined to, for instance, otherapplications 147 at the second host 106 b. The NIC 136 at the first host106 a can forward the generated packet 114 to the packet processor 138for processing according to certain policies in a flow table. Onceprocessed, the packet processor 138 can forward the outbound packet 114to the first TOR 112 a, which in turn forwards the packet to the secondTOR 112 b via the overlay/underlay network 108 and 108′.

The second TOR 112 b can then forward the packet 114 to the packetprocessor 138 at the second host 106 b to be processed according toother network policies in another flow table at the second host 106 b.If the packet processor 138 cannot identify a packet as belonging to anyflow, the packet processor 138 can forward the packet to the processor132 via the NIC 136 for exception processing. In another example, whenthe first TOR 112 a receives an inbound packet 115, for instance, fromthe second host 106 b via the second TOR 112 b, the first TOR 112 a canforward the packet 115 to the packet processor 138 to be processedaccording to a network policy associated with a flow of the packet 115.The packet processor 138 can then forward the processed packet 115 tothe NIC 136 to be forwarded to, for instance, the application 147 or thevirtual machine 144.

Managing large numbers of network policies with different semantics invirtual networks 146 can be difficult for tenants. Individual networkpolicies are typically not amenable to human inspection unless the rulesof the network policies are exceedingly trivial. The difficulty ofmanaging network policies only grows with scale. For example, a networkpolicy with three rules may be manually inspected. However, a set ofhundreds of network policies each having hundreds of rules is no longeramenable to human inspection. As such, tenants managing complex networkpolicies often make configuration changes that inadvertently regresssafety and/or availability of various resources on the tenant's virtualnetworks. Several embodiments of the disclosed technology can addressseveral aspects of the foregoing difficulty by implementing the networkverifier 125 configured to translate network policies of computernetworks (e.g., virtual networks 146) into Boolean logic formulas via anintermediate representation (IR), e.g., a network graph. The networkverifier 125 can then utilize a suitable solver of the Boolean logicformula to answer whether two endpoints in the virtual networks 146 canreach each other, as described in more detail below with reference toFIGS. 3A-6 .

FIGS. 3A and 3B are schematic diagrams illustrating example componentsand operations of a network verifier 125 suitable for verifying networkaccess in the distributed computing system 100 of FIG. 1 in accordancewith embodiments of the disclosed technology. As shown in FIGS. 3A and3B, the network verifier 125 can include a graph developer 160, a routefinder 162, a compiler 164, and a solver 166 operatively coupled to oneanother. Though the foregoing components of the network verifier 125 areshown in FIGS. 3A and 3B for illustration purposes, in otherembodiments, the network verifier 125 can include interface, network,database, or other suitable components in addition to or in lieu ofthose illustrated in FIGS. 3A and 3B. For instance, one or more of theforegoing components (e.g., the solver) may be separate from the networkverifier 125.

As shown in FIG. 3A, the graph developer 130 can be configured toreceive network policies 150 from, for example, a database such as adeployment configuration database (not shown) maintained by a resourcemanager of a cloud computing platform. The retrieved network policies150 can include data representing organization of deployment of virtualnetworks 146 of a tenant. For instance, the illustrated exampleorganization includes virtual WAN hubs 143 connecting multiple sites(e.g., HQ and Branches) in different regions (e.g., “Region 1” and“Region 2”) via site-to-site VPNs. The virtual WAN hubs 143 are alsoconnected to multiple virtual networks 146 via corresponding virtualnetwork connections 149 and to each other via a hub-to-hub connection145. The organization can also include an express route connection 151to the head quarter (shown as “HQ/DC”) as well as point-to-site VPNconnections 153 to remote users 101. Example network policies caninclude NSGs, route tables, firewalls, service endpoints, privateendpoints, service firewalls, ASGs, virtual WAN, virtual peering, orother suitable types of network policies implemented at various nodes inthe virtual networks 146.

Upon receiving the network policies 150, the graph developer 130 can beconfigured to convert the retrieved network policies 150 into a networkgraph 152 having multiple nodes 182 each representing a policyenforcement point and interconnected with one another by edges 184representing packet transmissions and/or transformations, as shown inFIG. 3B. The edges 184 can also each carry an annotation 186 (shown inFIG. 4 ) that describes a network policy effective for the edges 184.For instance, example policy enforcement points can include VMs, NSGs onnetwork interface cards (NICs), subnets inbound and outbound, virtualnetwork inbound and outbound, etc. Thus, an example network graph inFIG. 3B includes a node 182 a representing a first VM connected by anedge 184 to a node 182 b representing an outbound NSG of a NIC connectedto the first VM. The edge 184 representing a packet transmission ortransformation, e.g., the packet has a source IP address for the VM/NICtransmitted from the VM to the NIC. The example network graph 152 canalso include additional nodes 182 c and 182 d representing a subnet anda virtual network 144 (shown in FIG. 2 ) connected by additional edges144. The network graph 152 can also include additional nodes 182 e, 182f, and 182 g representing another subnet connected to the virtualnetwork 144, an inbound NSG corresponding to a second VM on another NIC,and the second VM connected to the other NIC.

Upon identifying the nodes 182 and edges 184 of the network graph 152,the graph developer 160 can be configured to encode each node 182 in thenetwork graph 152 for evaluating whether a packet is allowed to beforwarded or dropped. For example, as shown in FIG. 3B, a node 182 frepresenting an NSG can be encoded using a recursive function “Allow”that evaluates a packet received at the node to produce a Boolean output(illustratively named “Zen”) indicating whether the packet is allowed ordropped in C #language as follows:

Zen<bool> Allow(Nsg, Zen<Packet> pkt, int i) {  if (i >=nsg.Rules.Length)   return false; //if index of rules exceed max,return//  var rule = nsg.Rules[i]; //process Rule[i]//  returnIf(Matches(rule, pkt), rule.Permit, Allow(nsg, pkt, i+1)); // if packetmatches Rule[i], output permit from rule; otherwise, call next rule// }A shown above, the function “Allow” is implemented as a recursivefunction that takes as input an NSG having one or more rules, a packetmodeled as a Zen<Packet> type, and an index of the rule that is to beprocessed (set to zero on the first call), and finally provides anoutput of type Zen<bool> indicating if the packet was dropped orallowed. Another example network graph 152 is described in more detailbelow with reference to FIG. 4 .

Upon constructing the network graph 152, the network verifier 125 canreceive a query 154 from a network administrator or other suitableentities regarding, for example, whether a packet from the first VM canreach the second VM in the virtual network 144, as shown in FIG. 3B. Thequery 154 can also include IP addresses of the first and second VM aswell as port identifiers or other suitable information. In response toreceiving the query 154, the route finder 162 can be configured to traceone or more network paths 188 between nodes 182 a and 182 g representingthe first and second VMs in the virtual network 144 on the network graph152. For each of the one or more network paths 188, the route finder 162can be configured to generate a compound function 190 (shown in FIG. 5 )that conjoins all the recursive functions 154 of the various nodes 182along the traced one or more network paths 188. For example, thecompound function 190 can take an output from a first recursive functionof a first node 182 a as input to a second recursive function at asecond node 182 b downstream of the first node 182 a. The compoundfunction 190 can repeat such conjoining operations until all recursivefunctions along a network path 188 is processed. An example compoundfunction 190 is described in more detail below with reference to FIG. 5.

The compiler 164 can then use a library 168 to convert the generatedcompound function 190 of the network path 188 from the route finder 162into a logic representation 156 using, for example, Abstract Syntax Tree(AST) to represent a Boolean logic formula of the compound function, asshown in FIG. 3B. For example, the code for the recursive function abovecan be initially converted into a list of tokens describing thedifferent parts of the C #code. The list of tokens can then be parsed toidentify function calls, function definitions, groupings, etc. arrangedas a tree to represent a structure of the C #code. The tree can then beconverted into different kinds of code. For example, the output code canbe JavaScript, machine code, or other suitable types of code. An examplelibrary for converting the compound function can be retrieved fromhttps://github.com/microsoft/zen.

Based on the logic representation 156 of the network policies 150 (shownin FIG. 3A) corresponding to the compound function 190, the solver 166,e.g., the Z3 theorem prover is used to determine whether a packet havinga source IP address value and source port value of the first VM and adestination IP address value and destination port value of the second VMcan reach the second VM. The reachability between the first and secondVMs is confirmed only if there exists an assignment of values to thepacket fields such that all the constraints of the compound function 190are satisfied. In the illustrated example in FIG. 3B, the output fromthe solver 166 is shown as a verification result 158 according to whicha node representing “X” can reach a node representing “Z” via anothernode representing “Y” but not directly reach the node representing “Z.”

Several embodiments of the network verifier 125 described above can thusallow tenants to efficiently test and/or troubleshoot networkconfiguration issues in virtual networks 146. The network verifier 125can receive a query 154 as input, analyzes network paths 188 in thevirtual networks 146, collect constraints along the network path 188,and conjoin the constraints. The network verifier can then compile theconjoined constraints into a logic representation 156 and use a solver166 to solve the conjoined constraints to determine whether reachabilitybetween two endpoints in the virtual network 146 is preserved. Severalembodiments of the network verifier 125 can also output and indicate tothe tenants which node on the network graph 188 that caused a packet tobe dropped, as described in more detail below with reference to FIG. 6 .As such, tenants can readily test modifications of network policies andtroubleshoot any misconfigurations in the virtual networks 146 beforesuch modification is deployed in the virtual networks 146.

FIG. 4 illustrates an example network graph 152 of a virtual network 146in accordance with embodiments of the disclosed technology. As shown inFIG. 4 , each node 182 in the network graph represents a resource in thevirtual network 146 that performs some packet forwarding function in anetwork path 188. For example, VM1 is a virtual machine in this networkgraph 152. All packets originating in VM1 have a specific source addressassigned to VM1 and a corresponding NIC and transition to theNIC-NSG-out node. The NIC-NSG-out node represents outbound rules in theNSG policy applied to the NIC. Packets that are allowed by the outboundNIC policy take the subsequent edge that connects to the subnet-NSG-outnode. The subnet-NSG-node represents the outbound rules in the NSGpolicy applied to a subnet.

Packets that are allowed by the outbound subnet policy take thesubsequence edge 184 that connects to the subnet1_out node 182. Thesubnet1_out node 182 represents the user-defined routing rules appliedin the subnet. Packets targeting destination inside the same virtualnetwork 146 evaluate with a “nexthop” of “vnetlocal” per theuser-defined routing policy. Such packets take the subsequent edge 184that connects to the “Vnet1” node 182. The “Vnet1” node 182 representsthe virtual network comprising the subnets that host VM1 and VM2. If thedestination address of the packets is set to VM2, then the packets takethe subsequent edge to subnet1_in node 182. Packets are then forwardedto the subnet-NSG-in node 182. The subnet-NSG-in node 182 represents aninbound NSG policy applied to the subnet. The packets allowed by theinbound NSG policy now take the subsequent edge to the NIC-NSG-in node182. The NIC-NSG-in node 182 represents the inbound NSG policy appliedto the NIC connected to VM2. Packets allowed by this policy take thesubsequent edge to finally reach VM2.

FIG. 5 illustrates a compound function 190 in the example network graphof the virtual network in FIG. 4 in accordance with embodiments of thedisclosed technology. As shown in FIG. 5 , packets from VM1 can havecertain metadata represented by “S” having, for instance, source IPaddress, Destination IP address, source port, destination port, etc.Function C1 can be configured to determine whether the packets include asource IP address that corresponds to VM1 and the corresponding NIC.Output of the function C1 is then used as input to function C2 todetermine whether the packets are allowed by the NIC NSG. Output fromfunction C2 is then used as input to function C3 to determine whetherthe packets are allowed by subnet NSG. The operations continue until thenetwork path reaches VM2 to derive a compound function 190, e.g.,“c8(c7(c6(c5(c4(c3(c2(c1(S)))))))).”

FIG. 6 is a schematic block diagram illustrating example verificationoutput 158 from the network verifier 125 in accordance with embodimentsof the disclosed technology. As shown in FIG. 6 , in certainembodiments, the network verifier 125 (shown in FIG. 3A) can also beconfigured to output verification results 158 at each node 182 on thenetwork graph 152. For example, the following illustrates an evaluationresult of a routing table from Subnet1_out to Vnet1:

{  Type: “RoutingTable”,  Destination: “10.111.0.0/16”,  NextHop:“VnetLocal”,  }As shown above, the example above shows that a packet is forwarded to“VnetLocal” to a node 182 with a destination IP of “10.111.0.0/16.” Inanother example, the following illustrates another evaluation result ofan NSG that denied access to a packet:

{  Type: “NetworkSecurityGroup”,  Description: “Deny to Internet”, Destination: “0.0.0.0/0”,  Source: “*”,  DestinationPorts: “*”, SourcePorts: “*”,  Priority: 65000, }In the example above, all traffic to the Internet is blocked at the NSGnode 182. Several embodiments of the network verifier can also indicateto the tenants which node 182 on the network graph that caused a packetto be dropped. As such, tenants can readily troubleshoot anymisconfigurations in the virtual networks 146 (shown in FIG. 2 ).

FIG. 7 is a computing device 300 suitable for certain components of thedistributed computing system 100 in FIG. 1 . For example, the computingdevice 300 can be suitable for the hosts 106, the client devices 102, orthe network verifier 125 of FIG. 1 . In a very basic configuration 302,the computing device 300 can include one or more processors 304 and asystem memory 306. A memory bus 308 can be used for communicatingbetween processor 304 and system memory 306.

Depending on the desired configuration, the processor 304 can be of anytype including but not limited to a microprocessor (μP), amicrocontroller (μC), a digital signal processor (DSP), or anycombination thereof. The processor 304 can include one more level ofcaching, such as a level-one cache 310 and a level-two cache 312, aprocessor core 314, and registers 316. An example processor core 314 caninclude an arithmetic logic unit (ALU), a floating-point unit (FPU), adigital signal processing core (DSP Core), or any combination thereof.An example memory controller 318 can also be used with processor 304, orin some implementations memory controller 318 can be an internal part ofprocessor 304.

Depending on the desired configuration, the system memory 306 can be ofany type including but not limited to volatile memory (such as RAM),non-volatile memory (such as ROM, flash memory, etc.) or any combinationthereof. The system memory 306 can include an operating system 320, oneor more applications 322, and program data 324. As shown in FIG. 7 , theoperating system 320 can include a hypervisor 140 for managing one ormore virtual machines 144. This described basic configuration 302 isillustrated in FIG. 8 by those components within the inner dashed line.

The computing device 300 can have additional features or functionality,and additional interfaces to facilitate communications between basicconfiguration 302 and any other devices and interfaces. For example, abus/interface controller 330 can be used to facilitate communicationsbetween the basic configuration 302 and one or more data storage devices332 via a storage interface bus 334. The data storage devices 332 can beremovable storage devices 336, non-removable storage devices 338, or acombination thereof. Examples of removable storage and non-removablestorage devices include magnetic disk devices such as flexible diskdrives and hard-disk drives (HDD), optical disk drives such as compactdisk (CD) drives or digital versatile disk (DVD) drives, solid statedrives (SSD), and tape drives to name a few. Example computer storagemedia can include volatile and nonvolatile, removable, and non-removablemedia implemented in any method or technology for storage ofinformation, such as computer readable instructions, data structures,program modules, or other data. The term “computer readable storagemedia” or “computer readable storage device” excludes propagated signalsand communication media.

The system memory 306, removable storage devices 336, and non-removablestorage devices 338 are examples of computer readable storage media.Computer readable storage media include, but not limited to, RAM, ROM,EEPROM, flash memory or other memory technology, CD-ROM, digitalversatile disks (DVD) or other optical storage, magnetic cassettes,magnetic tape, magnetic disk storage or other magnetic storage devices,or any other media which can be used to store the desired information,and which can be accessed by computing device 300. Any such computerreadable storage media can be a part of computing device 300. The term“computer readable storage medium” excludes propagated signals andcommunication media.

The computing device 300 can also include an interface bus 340 forfacilitating communication from various interface devices (e.g., outputdevices 342, peripheral interfaces 344, and communication devices 346)to the basic configuration 302 via bus/interface controller 330. Exampleoutput devices 342 include a graphics processing unit 348 and an audioprocessing unit 350, which can be configured to communicate to variousexternal devices such as a display or speakers via one or more A/V ports352. Example peripheral interfaces 344 include a serial interfacecontroller 354 or a parallel interface controller 356, which can beconfigured to communicate with external devices such as input devices(e.g., keyboard, mouse, pen, voice input device, touch input device,etc.) or other peripheral devices (e.g., printer, scanner, etc.) via oneor more I/O ports 358. An example communication device 346 includes anetwork controller 360, which can be arranged to facilitatecommunications with one or more other computing devices 362 over anetwork communication link via one or more communication ports 364.

The network communication link can be one example of a communicationmedia. Communication media can typically be embodied by computerreadable instructions, data structures, program modules, or other datain a modulated data signal, such as a carrier wave or other transportmechanism, and can include any information delivery media. A “modulateddata signal” can be a signal that has one or more of its characteristicsset or changed in such a manner as to encode information in the signal.By way of example, and not limitation, communication media can includewired media such as a wired network or direct-wired connection, andwireless media such as acoustic, radio frequency (RF), microwave,infrared (IR) and other wireless media. The term computer readable mediaas used herein can include both storage media and communication media.

The computing device 300 can be implemented as a portion of a small-formfactor portable (or mobile) electronic device such as a cell phone, apersonal data assistant (PDA), a personal media player device, awireless web-watch device, a personal headset device, an applicationspecific device, or a hybrid device that include any of the abovefunctions. The computing device 300 can also be implemented as apersonal computer including both laptop computer and non-laptop computerconfigurations.

From the foregoing, it will be appreciated that specific embodiments ofthe disclosure have been described herein for purposes of illustration,but that various modifications may be made without deviating from thedisclosure. In addition, many of the elements of one embodiment may becombined with other embodiments in addition to or in lieu of theelements of the other embodiments. Accordingly, the technology is notlimited except as by the appended claims.

I/We claim:
 1. A method of network configuration verification in adistributed computing system supporting one or more virtual networks,the method comprising: based on network policies corresponding to avirtual network implemented in the distributed computing system,generating an intermediate representation of the virtual network, theintermediate representation including enforcement points of the networkpolicies and edges representing transmission or transformation ofpackets in the virtual network; in response to receiving a query todetermine whether a packet from a first endpoint is reachable by asecond endpoint in the virtual network: identifying a network path forthe packet from the first endpoint to the second endpoint in thegenerated intermediate representation; representing conjoined individualconstraints of the network policies in the intermediate representationalong the identified network path; generating a logical representationof the conjoined individual constraints; and based on the logicalrepresentation, determining that an assignment of values to packetfields of the packet exists such that all the conjoined individualconstraints of the logical representation are satisfied, therebyverifying that the packet from the first endpoint is reachable by thesecond endpoint in the virtual network; and sending a response to thequery indicating that the packet from the first endpoint is reachable bythe second endpoint in the virtual network.
 2. The method of claim 1,further comprising: in response to determining that an assignment ofvalues to packet fields of the packet exists, outputting an indicationthat the first endpoint is reachable to the second endpoint in thevirtual network; and in response to determining that an assignment ofvalues to packet fields of the packet does not exist, outputting anindication that the first endpoint is not reachable to the secondendpoint in the virtual network.
 3. The method of claim 1 wherein theenforcement points correspond to virtual machines, network securitygroups, subnets, or virtual networks.
 4. The method of claim 1 wherein:the network policies each includes one or more rules representing theconstraints on processing the packet; and the one or more rulesrepresenting a network security group, a route table, a firewall, anapplication security group, a virtual wide area network, or virtualpeering.
 5. The method of claim 1 wherein: the network policies eachincludes one or more rules representing the constraints on processingthe packet; and generating the intermediate representation includesencoding nodes in the intermediate representation with a functionconfigured to recursively evaluate the one or more rules of one of thenetwork policies.
 6. The method of claim 1 wherein: the network policieseach includes one or more rules representing the constraints onprocessing the packet; and generating the intermediate representationincludes: encoding nodes in the intermediate representation with afunction configured to recursively evaluate the one or more rules of oneof the network policies; and attaching an annotation to each of theedges, the annotation indicating the one or more rules effective for theeach of the edges.
 7. The method of claim 1 wherein: the networkpolicies each includes one or more rules representing the constraints onprocessing the packet; generating the intermediate representationincludes encoding nodes in the intermediate representation with afunction configured to recursively evaluate the one or more rules of oneof the network policies; and representing conjoined individualconstraints includes conjoining multiple recursive functions of at leastsome of the nodes along the identified network path.
 8. The method ofclaim 1 wherein generating the intermediate representation includes:generating the intermediate representation as a logic representation ofthe conjoined individual constraints; and converting the logicrepresentation into a code corresponding to a solver that is configuredto determine whether an assignment of values to packet fields of thepacket exists such that all the conjoined individual constraints can besatisfied.
 9. The method of claim 1, further comprising: subsequent todetermining that the assignment of values to packet fields of the packetexists, receiving a modification to one of the network policies; andupon receiving the modification, regenerating a network graph based onthe received modification to one of the network polices; and repeatingthe identifying, generating, compiling, and solving operations todetermine whether an assignment of values to packet fields of the packetexists such that all the conjoined individual constraints can besatisfied.
 10. A computing device in a distributed computing systemsupporting one or more virtual networks, the computing devicecomprising: a processor; and a memory operatively coupled to theprocessor, the memory including instructions that, when executed by theprocessor, cause the computing device to: in response to receiving aquery to determine whether a packet from a first endpoint is reachableby a second endpoint in a virtual network supported by the distributedcomputing system: identify a network path for the packet from the firstendpoint to the second endpoint in an intermediate representation havingenforcement points of network policies in the virtual network and edgesrepresenting packet transmission or transformation in the virtualnetwork; generate a function representing conjoined individualconstraints of the network policies in the intermediate representationalong the identified network path; generating a logical representationof the conjoined individual constraints along the identified networkpath; based on the logical representation, determine that an assignmentof values to packet fields of the packet exists such that all theconjoined individual constraints can be satisfied; and output anindication that the packet from the first endpoint is reachable by thesecond endpoint in the virtual network in response to determining thatan assignment of values to packet fields of the packet exists.
 11. Thecomputing device of claim 10 wherein: the network policies each includesone or more rules representing the constraints on processing the packet;and each node in the intermediate representation is encoded with afunction configured to recursively evaluate the one or more rules of oneof the network policies.
 12. The computing device of claim 10 wherein:the network policies each includes one or more rules representing theconstraints on processing the packet; each node in the intermediaterepresentation is encoded with a function configured to recursivelyevaluate the one or more rules of one of the network policies; and eachof the edges is annotated with an indication of the one or more ruleseffective for the each of the edges.
 13. The computing device of claim10 wherein: the network policies each includes one or more rulesrepresenting the constraints on processing the packet; each node in theintermediate representation is encoded with a function configured torecursively evaluate the one or more rules of one of the networkpolicies; and determine that the assignment of values to packet fieldsof the packet exists includes to conjoin multiple recursive functions ofat least some of the nodes along the identified network path.
 14. Thecomputing device of claim 10 wherein generate the logical representationcomprises: generate the logical representation as a logic representationof the conjoined individual constraints; and convert the logicrepresentation into a code corresponding to a solver that is configuredto determine whether an assignment of values to packet fields of thepacket exists such that all the conjoined individual constraints can besatisfied.
 15. The computing device of claim 10 wherein the memoryincludes additional instructions executable by the processor to causethe computing device to: subsequent to determining that the assignmentof values to packet fields of the packet exists: receive a modificationto one of the network policies; and upon receiving the modification,regenerate another intermediate representation based on the receivedmodification to one of the network polices; and determine whether anassignment of values to packet fields of the packet exists such that allthe conjoined individual constraints can be satisfied.
 16. A method ofnetwork configuration verification in a distributed computing systemsupporting one or more virtual networks, the method comprising: inresponse to receiving a query to determine whether a packet from a firstendpoint is reachable to a second endpoint in a virtual networksupported by the distributed computing system: identifying a networkpath for the packet from the first endpoint to the second endpoint in anintermediate representation having enforcement points of networkpolicies in the virtual network and edges representing packettransmission or transformation in the virtual network; generating afunction representing conjoined individual constraints of the networkpolicies in the intermediate representation along the identified networkpath; generating a logical representation of the conjoined individualconstraints along the identified network path; based on the logicalrepresentation, determining that an assignment of values to packetfields of the packet exists such that all the conjoined individualconstraints can be satisfied; and outputting an indication that thepacket from the first endpoint is reachable by the second endpoint inthe virtual network in response to determining that an assignment ofvalues to packet fields of the packet exists.
 17. The method of claim 16wherein: the network policies each includes one or more rulesrepresenting the constraints on processing the packet; and each node inthe intermediate representation is encoded with a function configured torecursively evaluate the one or more rules of one of the networkpolicies.
 18. The method of claim 16 wherein: the network policies eachincludes one or more rules representing the constraints on processingthe packet; each node in the intermediate representation is encoded witha function configured to recursively evaluate the one or more rules ofone of the network policies; and each of the edges is annotated with anindication of the one or more rules effective for the each of the edges.19. The method of claim 16 wherein: the network policies each includesone or more rules representing the constraints on processing the packet;each node in the intermediate representation is encoded with a functionconfigured to recursively evaluate the one or more rules of one of thenetwork policies; and determining that the assignment of values topacket fields of the packet exists includes conjoining multiplerecursive functions of at least some of the nodes along the identifiednetwork path.
 20. The method of claim 16 wherein determining that theassignment of values to packet fields of the packet exists includes:generating the logical representation as a logic representation of theconjoined individual constraints; and converting the logicrepresentation into a code corresponding to a solver that is configuredto determine whether an assignment of values to packet fields of thepacket exists such that all the conjoined individual constraints can besatisfied.